منابع مشابه
Randomness Is Unpredictability
The concept of randomness has been unjustly neglected in recent philosophical literature, and when philosophers have thought about it, they have usually acquiesced in views about the concept that are fundamentally flawed. After indicating the ways in which these accounts are flawed, I propose that randomness is to be understood as a special case of the epistemic concept of the unpredictability ...
متن کاملRandomness is Unpredictability
The concept of randomness has been unjustly neglected in recent philosophical literature, and when philosophers have thought about it, they have usually acquiesced in views about the concept that are fundamentally flawed. After indicating the ways in which these accounts are flawed, I propose that randomness is to be understood as a special case of the epistemic concept of the unpredictability ...
متن کاملRandomness is Hard
We study the set of incompressible strings for various resource bounded versions of Kolmogorov complexity. The resource bounded versions of Kolmogorov complexity we study are: polynomial time CD complexity deened by Sipser, the nondeterministic variant due to Buhrman and Fortnow, and the polynomial space bounded Kolmogorov complexity, CS introduced by Hartmanis. For all of these measures we dee...
متن کاملIs Randomness Necessary?∗
There are many instances where apparent randomness is actually in the eye of the beholder. An example from my own experience is the following. A fellow researcher once came upon a curious sequence in connection with his work on a certain sorting algorithm. It was defined recursively as follows. The first term, call it x(1), was equal to 3. In general, to get the (n + 1)st term x(n + 1), you tak...
متن کاملCondensed Unpredictability
We consider the task of deriving a key with high HILL entropy (i.e., being computationally indistinguishable from a key with high min-entropy) from an unpredictable source. Previous to this work, the only known way to transform unpredictability into a key that was indistinguishable from having min-entropy was via pseudorandomness, for example by Goldreich-Levin (GL) hardcore bits. This approach...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The British Journal for the Philosophy of Science
سال: 2005
ISSN: 0007-0882,1464-3537
DOI: 10.1093/bjps/axi138